A Multiscale Data-Driven Stochastic Method for Elliptic PDEs with Random Coefficients
نویسندگان
چکیده
In this paper, we propose a multiscale data-driven stochastic method (MsDSM) to study stochastic partial differential equations (SPDEs) in the multiquery setting. This method combines the advantages of the recently developed multiscale model reduction method [M. L. Ci, T. Y. Hou, and Z. Shi, ESAIM Math. Model. Numer. Anal., 48 (2014), pp. 449–474] and the datadriven stochastic method (DSM) [M. L. Cheng et al., SIAM/ASA J. Uncertain. Quantif., 1 (2013), pp. 452–493]. Our method consists of offline and online stages. In the offline stage, we decompose the harmonic coordinate into a smooth part and a highly oscillatory part so that the smooth part is invertible and the highly oscillatory part is small. Based on the Karhunen–Loève (KL) expansion of the smooth parts and oscillatory parts of the harmonic coordinates, we can derive an effective stochastic equation that can be well-resolved on a coarse grid. We then apply the DSM to the effective stochastic equation to construct a data-driven stochastic basis under which the stochastic solutions enjoy a compact representation for a broad range of forcing functions. In the online stage, we expand the SPDE solution using the data-driven stochastic basis and solve a small number of coupled deterministic partial differential equations (PDEs) to obtain the expansion coefficients. The MsDSM reduces both the stochastic and the physical dimensions of the solution. We have performed complexity analysis which shows that the MsDSM offers considerable savings over not only traditional methods but also DSM in solving multiscale SPDEs. Numerical results are presented to demonstrate the accuracy and efficiency of the proposed method for several multiscale stochastic problems without scale separation.
منابع مشابه
Cluster-based Generalized Multiscale Finite Element Method for elliptic PDEs with random coefficients
We propose a generalized multiscale finite element method (GMsFEM) based on clustering algorithm to study the elliptic PDEs with random coefficients in the multiquery setting. Our method consists of offline and online stages. In the offline stage, we construct a small number of reduced basis functions within each coarse grid block, which can then be used to approximate the multiscale finite ele...
متن کاملA Data-Driven Stochastic Method for Elliptic PDEs with Random Coefficients∗
We propose a data-driven stochastic method (DSM) to study stochastic partial differential equations (SPDEs) in the multiquery setting. An essential ingredient of the proposed method is to construct a data-driven stochastic basis under which the stochastic solutions to the SPDEs enjoy a compact representation for a broad range of forcing functions and/or boundary conditions. Our method consists ...
متن کاملExploring the Locally Low Dimensional Structure in Solving Random Elliptic PDEs
We propose a stochastic multiscale finite element method (StoMsFEM) to solve random elliptic partial differential equations with a high stochastic dimension. The key idea is to simultaneously upscale the stochastic solutions in the physical space for all random samples and explore the low stochastic dimensions of the stochastic solution within each local patch. We propose two effective methods ...
متن کاملMultilevel Monte Carlo Methods for Stochastic Elliptic Multiscale PDEs
In this paper Monte Carlo Finite Element (MC FE) approximations for elliptic homogenization problems with random coefficients which oscillate on n ∈ N a-priori known, separated length scales are considered. The convergence of multilevel MC FE (MLMC FE) discretizations is analyzed. In particular, it is considered that the multilevel FE discretization resolves the finest physical length scale, bu...
متن کاملA Priori Error Analysis of Stochastic Galerkin Mixed Approximations of Elliptic PDEs with Random Data
We construct stochastic Galerkin approximations to the solution of a first-order system of PDEs with random coefficients. Under the standard finite-dimensional noise assumption, we transform the variational saddle point problem to a parametric deterministic one. Approximations are constructed by combining mixed finite elements on the computational domain with M -variate tensor product polynomia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Multiscale Modeling & Simulation
دوره 13 شماره
صفحات -
تاریخ انتشار 2015